Sequence schedules of reinforcement1
نویسندگان
چکیده
منابع مشابه
Flowshop Schedules with Sequence Dependent Setup Times
The flowshop scheduling problem with sequence dependent setup times is considered and shown to be NP-complete. A traveling salesman problem formulation is proposed for the case where jobs are processed continuously through the shop. These results are used to describe an approximate algorithm for the case where limited or infinite intermediate storage space is available to hold partially complet...
متن کاملLearning Strict Nash Equilibria through Reinforcement1
This paper studies the analytical properties of the reinforcement learning model proposed in Erev and Roth (1998), also termed cumulative reinforcement learning in Laslier et al. (2001). The stochastic model of learning accounts for two main elements: the Law of E¤ect (positive reinforcement of actions that perform well) and the Power Law of Practice (learning curves tend to be steeper initiall...
متن کاملDosimetric comparison of treatment of left breast cancer using two different dose schedules Dosimetric comparison of treatment of left breast cancer using two different dose schedules
Background: To date, different kinds of treatment methods have been proposed for radiotherapy of cancer patients. Choosing the kind of treatment method affects the quality of the patient's treatment. This study aims to investigate the effect of the number of radiation treatment sessions on the dose received by the patient and the distribution of tumor dose and dose received by organs at risk in...
متن کاملPermutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
Through the use of an effective simulated annealing algorithm, this paper presents an extensive computational investigation concerning the performance evaluation of non-permutation vs. permutation schedules for the flowline manufacturing cell with sequence dependent setup times. The results show that there are significant improvements made by using non-permutation schedules over permutation sch...
متن کاملLiquid Schedules of Network Traffics
We introduce the theory of liquid schedules, a method for the optimal scheduling of collective data exchanges relying on the knowledge of the underlying network topology and routing scheme. Liquid schedules ensure the maximal utilization of network’s bottlenecks and offers an aggregate throughput as high as the flow capacity of a liquid in a network of pipes. The limiting factors of liquid sche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Experimental Analysis of Behavior
سال: 1971
ISSN: 0022-5002
DOI: 10.1901/jeab.1971.15-41